A Geometric and Combinatorial Exploration of Hochschild Lattices

نویسندگان

چکیده

Hochschild lattices are specific intervals in the dexter meet-semilattices recently introduced by Chapoton. A natural geometric realization of these leads to some cell complexes Saneblidze, called polytopes. We obtain several geometrical properties lattices, namely we give cubic realizations, establish that EL-shellable, and show they constructible interval doubling. also prove combinatorial as enumeration their $k$-chains compute degree polynomials.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class of Geometric Lattices

and that the same holds if any n— 1 of the signs are replaced by strict inequality. Those unimodular lattices, such as Z , which have only the origin in common with the open cube shall be called critical, as shall the corresponding matrices. Minkowski conjectured, and Hajos [ l ] proved in 1938, that a critical lattice must contain one of the points (5»i, • • • , 5,-»), i = 1, • • • , n. If A i...

متن کامل

A Geometric Model for Hochschild Homology of Soergel Bimodules

An important step in the calculation of the triply graded link theory of Khovanov and Rozansky is the determination of the Hochschild homology of Soergel bimodules for SL(n). We present a geometric model for this Hochschild homology for any simple group G, as equivariant intersection homology of B × Borbit closures in G. We show that, in type A these orbit closures are equivariantly formal for ...

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

Envelopes of Geometric Lattices

A categorical embedding theorem is proved for geometric lattices. This states roughly that, if one wants to consider only those embeddings into pro-jective spaces having a suitable universal property, then the existence of such an embedding can be checked by seeing whether corresponding properties hold for many small intervals. Tutte's embedding theorem for binary geometric lattices is a conseq...

متن کامل

Finite distributive lattices are congruence lattices of almost- geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice, if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2021

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9929